Least squares order-recursive lattice smoothers - Signal Processing, IEEE Transactions on
نویسندگان
چکیده
AbstructConventional least squares order-recursive lattice (LSORL) filters use present and past data values to estimate the present value of a signal. This paper introduces LSORL smoothers which use past, present and future data for that purpose. Except for an overall delay needed for physical realization, LSORL smoothers can substantially outperform LSORL filters while retaining all the advantages of an order-recursive structure.
منابع مشابه
Order-recursive RLS Laguerre adaptive filtering
This paper solves the problem of designing recursive-least-squares (RLS) lattice (or order-recursive) algorithms for adaptive filters that do not involve tapped-delay-line structures. In particular, an RLS–Laguerre lattice filter is obtained.
متن کاملQR-decomposition-based least-squares lattice interpolators
QR-decomposition-based least-squares lattice (QRD-LSL) predictors have been extensively applied in the design of order-recursive adaptive filters. This work presents QRD-LSL interpolators that use both past and future data samples to estimate the present data sample based on a novel decoupling property. We show that the order-recursive QRD-LSL interpolators display better numerical properties a...
متن کاملSuperresolution restoration of an image sequence: adaptive filtering approach
This paper presents a new method based on adaptive filtering theory for superresolution restoration of continuous image sequences. The proposed methodology suggests least squares (LS) estimators which adapt in time, based on adaptive filters, least mean squares (LMS) or recursive least squares (RLS). The adaptation enables the treatment of linear space and time-variant blurring and arbitrary mo...
متن کاملAn order downdating algorithm for tracking system order and parameters in recursive least squares identification
In this correspondence, a new time and order recursive method for on-line tracking of system order and parameters using recursive least squares (RLS) is presented. The method consists of two parts: a time updating portion that uses existing RLS inverse QR decomposition algorithms and a new computationally efficient “order downdating” portion that calculates the model parameters and residual err...
متن کاملA delta least squares lattice algorithm for fast sampling
Most shift operator-based adaptive algorithms exhibit poor numerical behavior when the input discrete time process is obtained from a continuous time process by fast sampling. This includes the shift operator based least squares lattice algorithm. In this paper, we develop a delta least squares lattice algorithm. This algorithm has low computational complexity compared to the delta Levinson RLS...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997